Scaling of Network Delays
نویسندگان
چکیده
A recent result in network calculus theory provided statistical delay bounds for exponentially bounded traffic that grow as O(H log H) with the number of nodes on the network path. In this paper we establish the corresponding lower bound which shows that under these assumptions, typical end-to-end delays can indeed grow as Θ(H log H). The lower bound is obtained by analyzing the end-to-end delay in a tandem network. A critical assumption is that each packet maintains the same service time at each traversed node. The results of this paper provide conclusive evidence that, in general, delays have a qualitatively different scaling behavior than is suggested by a worst-case analysis or by assuming independence on the service obtained at network nodes.
منابع مشابه
Corrosion and scaling in Bandar Abbas Pipe water network
Introduction: Scaling and corrosion is one the most important indices in water quality evaluation. Occurrence of scaling or corrosion may create disorder in economy of water and wastewater industry. In addition, corrosion produces by - products in water leading to health problem and reduction of water pipe life-time. In this study, the condition of scaling and corrosion in Bandar Abbas wa...
متن کاملSynchronization for Complex Dynamic Networks with State and Coupling Time-Delays
This paper is concerned with the problem of synchronization for complex dynamic networks with state and coupling time-delays. Therefore, larger class and more complicated complex dynamic networks can be considered for the synchronization problem. Based on the Lyapunov-Krasovskii functional, a delay-independent criterion is obtained and formulated in the form of linear matrix inequalities (LMIs)...
متن کاملGlobal Asymptotic and Exponential Stability of Tri-Cell Networks with Different Time Delays
In this paper, a bidirectional ring network with three cells and different time delays is presented. To propose this model which is a good extension of three-unit neural networks, coupled cell network theory and neural network theory are applied. In this model, every cell has self-connections without delay but different time delays are assumed in other connections. A suitable Lyapun...
متن کاملOn Θ (H logH) Scaling of Network Delays
A recent result in network calculus theory provided statistical delay bounds for exponentially bounded traffic that grow as O(H logH) with the number of nodes on the network path. In this paper we establish the corresponding lower bound which shows that for such such types of traffic, typical end-toend delays can indeed grow as Θ(H logH). The lower bound is obtained by analyzing the end-to-end ...
متن کاملA new virtual leader-following consensus protocol to internal and string stability analysis of longitudinal platoon of vehicles with generic network topology under communication and parasitic delays
In this paper, a new virtual leader following consensus protocol is introduced to perform the internal and string stability analysis of longitudinal platoon of vehicles under generic network topology. In all previous studies on multi-agent systems with generic network topology, the control parameters are strictly dependent on eigenvalues of network matrices (adjacency or Laplacian). Since some ...
متن کامل